Blunder Cost in Go and Hex
نویسندگان
چکیده
In Go and Hex, we examine the effect of a blunder — here, a random move — at various stages of a game. For each fixed move number, we run a self-play tournament to determine the expected blunder cost at that point.
منابع مشابه
A hierarchical approach to computer Hex
Hex is a beautiful game with simple rules and a strategic complexity comparable to that of Chess and Go. The massive game-tree search techniques developed mostly for Chess and successfully used for Checkers and a number of other games, become less useful for games with large branching factors like Hex and Go. In this paper, we describe deduction rules, which are used to calculate values of comp...
متن کاملThe Game of Hex: An Automatic Theorem Proving Approach to Game Programming
The game of Hex is a two-player game with simple rules, a deep underlying mathematical beauty, and a strategic complexity comparable to that of Chess and Go. The massive game-tree search techniques developed mostly for Chess, and successfully used for Checkers, Othello, and a number of other games, become less useful for games with large branching factors like Go and Hex. We offer a new approac...
متن کاملMoHex 2.0: A Pattern-Based MCTS Hex Player
In recent years the Monte Carlo tree search revolution has spread from computer Go to many areas, including computer Hex. MCTS Hex players now outperform traditional knowledge-based alpha-beta search players, and the reigning Computer Olympiad Hex gold medallist is the MCTS player MoHex. In this paper we show how to strengthen MoHex, and observe that — as in computer Go — using learned patterns...
متن کاملThe Game of Hex: the Hierarchical Approach
The game of Hex is a beautiful and mind-challenging game with simple rules and a strategic complexity comparable to that of Chess and Go. Hex positions do not tend to decompose into sums of independent positions. Nevertheless, we demonstrate how to reduce evaluation of Hex positions to topological analysis of a hierarchy of simpler positions, and we develop corresponding recursive calculus. We ...
متن کاملMove Prediction using Deep Convolutional Neural Networks in Hex
Using deep convolutional neural networks for move prediction has led to massive progress in Computer Go. Like Go, Hex has a large branching factor that limits the success of shallow and selective search. We show that deep convolutional neural networks can be used to produce reliable move evaluation in the game of Hex. We begin by collecting self-play games of MoHex 2.0. We then train the neural...
متن کامل